Graph-Based Profiling of Blockchain Oracles
نویسندگان
چکیده
The usage of blockchain technology has been significantly expanded with smart contracts and oracles . While enables to automate the execution an agreement between untrusted parties, oracles provide data external a given blockchain, i.e., off-chain data. However, validity accuracy such can be questionable that compromises transparency immutability chacteristics blockchain. Despite many studies on trustworthiness oracles, more precisely, data, their solutions are often ‘short-sighted’ dependent binary decisions. In this paper, we present novel graph-based profiling method determine oracles. We construct graph as nodes cumulative average discrepancies edge weights. Our continues update graph, weights in particular, distinguish trustworthy Clearly. discourages provision false inaccurate have conducted evaluation study see effectiveness our proposed method, which run experiments utilizing Ethereum network. Additionally, also calculated cost running these experiments. Consequently, experiment results show achieves around 93% identifying sources.
منابع مشابه
Blockchain: A Graph Primer
Bitcoin and its underlying technology Blockchain have become popular in recent years. Designed to facilitate a secure distributed platform without central authorities, Blockchain is heralded as a paradigm that will be as powerful as Big Data, Cloud Computing and Machine learning. Blockchain incorporates novel ideas from various fields such as public key encryption and distributed systems. As su...
متن کاملGraph Reconstruction via Distance Oracles
We study the problem of reconstructing a hidden graph given access to a distance oracle. We design randomized algorithms for the following problems: reconstruction of a degree bounded graph with query complexity Õ(n); reconstruction of a degree bounded outerplanar graph with query complexity Õ(n); and near-optimal approximate reconstruction of a general graph.
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولThe Transaction Graph for Modeling Blockchain Semantics
The advent of Bitcoin paved the way for a plethora of blockchain systems supporting diverse applications beyond cryptocurrencies. Although in-depth studies of the protocols, security, and privacy of blockchains are available, there is no formal model of the transaction semantics that a blockchain is supposed to guarantee. In this work, we fill this gap, motivated by the observation that the sem...
متن کاملBlockchain Based Access Control
Access Control systems are used in computer security to regulate the access to critical or valuable resources. The rights of subjects to access such resources are typically expressed through access control policies, which are evaluated at access request time against the current access context. This paper proposes a new approach based on blockchain technology to publish the policies expressing t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2023
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2023.3254535